Minimal Algorithms for Lipschitz Monoids and Vahlen Monoids
نویسندگان
چکیده
منابع مشابه
Minimal counting systems and commutative monoids
These notes present an approach to obtaining the basic operations of addition and multiplication on the natural numbers in terms of elementary results about commutative monoids.
متن کاملGarside monoids vs divisibility monoids
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter ty...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملNormaliz: Algorithms for affine monoids and rational cones
Normaliz is a program for the computation of Hilbert bases of rational cones and the normalizations of affine monoids. It may also be used for solving diophantine linear systems. In this paper we present the algorithms implemented in the program.
متن کاملCartesian Monoids
The Cartesian monoid of partial piecewise shift operators is developed as a model for programming systems such as Backus’ FP. Special attention is paid to those elements which are equationally implicitly definable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2013
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v5n4p39